Sharp Threshold for Percolation on Expanders
نویسنده
چکیده
We study the appearance of the giant component in random subgraphs of a given finite graph G = (V, E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c ∈]0, 1[, the property that the random subgraph contains a giant component of size c|V | has a sharp threshold.
منابع مشابه
Sharp Threshold for Percolation on Expanders by Itai Benjamini,
We study the appearance of the giant component in random subgraphs of a given large finite graph G = (V , E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c ∈ ]0, 1[, the property that the random sub-graph contains a giant component of size c|V | has a sharp threshold. 1. Introduction. Percolation t...
متن کاملAsymptotics in bond percolation on expanders
We consider supercritical bond percolation on a family of high-girth d-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linearsized (“giant”) component is pc = 1/(d − 1). Our main result recovers the sharp asymptotics of the size and degree distribution of the vertices in the giant at any p > pc, as well as that of its 2-core...
متن کاملA model for modified electrode with carbon nanotube composites using percolation theory in fractal space
We introduce a model for prediction the behavior of electrodes which modified withcarbon nanotubes in a polymer medium. These kinds of polymer composites aredeveloped in recent years, and experimental data for its percolation threshold isavailable. We construct a model based on percolation theory and fractal dimensionsand using experimental percolation threshold for calculating the moments of c...
متن کاملBootstrap percolation with individual thresholds
Bootstrap percolation is a random process that models the spread of activation on a linked structure. Starting with an initial set of active vertices, in each round all inactive vertices with at least r active neighbors become and remain active until there are no inactive vertices with enough active neighbors left. Due to its numerous applications in modeling of physical processes, bootstrap pe...
متن کاملTHE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL
The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009